An FPGA Implementation of Triangle Mesh Decompression
نویسندگان
چکیده
This paper presents an FPGA-based design and implementation of a three dimensional (3D) triangle mesh decompressor. Triangle mesh is the dominant representation of 3D geometric models. The prototype decompressor is based on a simple and highly efficient triangle mesh compression algorithm, called BFT mesh encoding [10, 11]. To the best of our knowledge, this is the first hardware implementation of triangle mesh decompression. The decompressor can be added at the front-end of a 3D graphics card sitting on the PCI/AGP bus. It can reduce the bandwidth requirement on the bus between the host and the graphics card by up to 80% compared to standard triangle mesh representations. Other mesh decompression algorithms with comparable compression efficiency to BFT mesh encoding are too complex to be implemented in hardware.
منابع مشابه
Fast Multiresolution Mesh Decompression
Compression techniques for triangle-mesh representations of 3D models have been the focus of many recent efforts from the graphics, modeling, and theory research community; from developers of computer graphics hardware and software; and from organizations that define international standards. An ideal compression technology would simultaneously support the following three objectives: (1) progres...
متن کاملSQUEEZE: Fast and Progressive Decompression of Triangle Meshes
An ideal triangle mesh compression technology would simultaneously support the following three objectives: (1) progressive refinements of the received mesh during decompression, (2) nearly optimal compression ratios for both geometry and connectivity, and (3) in-line, real-time decompression algorithms for hardware or software implementations. Because these three objectives impose contradictory...
متن کاملEdgebreaker: Compressing the incidence graph of triangle meshes
Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case and the expected compression ratios of previously reported schemes, most of which require O(nlogn) bits to store the incidence graph of a mesh of n triangles. Edgebreaker requires only 2n bits or less for si...
متن کاملEdgebreaker: Connectivity Compression for Triangle Meshes
Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of three-dimensional triangle meshes. Edgebreaker improves upon the storage required by previously reported schemes, most of which can guarantee only an O(tlog(t)) storage cost for the incidence graph of a mesh of t triangles. Edgebreaker requires at most 2t bits for a...
متن کاملData-Parallel Decompression of Triangle Mesh Topology
We propose a lossless, single-rate triangle mesh topology codec tailored for fast data-parallel GPU decompression. Our compression scheme coherently orders generalized triangle strips in memory. To unpack generalized triangle strips efficiently, we propose a novel parallel and scalable algorithm. We order vertices coherently to further improve our compression scheme. We use a variable bit-lengt...
متن کامل